-
1 комбинаторная определенность
Русско-английский технический словарь > комбинаторная определенность
-
2 комбинаторная определенность
Русско-английский политехнический словарь > комбинаторная определенность
-
3 комбинаторная определенность
Русско-английский научно-технический словарь Масловского > комбинаторная определенность
-
4 комбинаторная определимость
combinatorial definability, combinatory definabilityРусско-английский словарь по вычислительной технике и программированию > комбинаторная определимость
-
5 комбинаторная определимость
1) Mathematics: combinatory definability2) Information technology: combinatorial definabilityУниверсальный русско-английский словарь > комбинаторная определимость
-
6 комбинаторная определённость
Mathematics: combinatorial definabilityУниверсальный русско-английский словарь > комбинаторная определённость
-
7 определённость
определё́нность ж.
definitenessдля определё́нности допу́стим … — for definiteness, assume …комбина́торная определё́нность мат. — combinatorial definability
См. также в других словарях:
History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
History of logic — Philosophy ( … Wikipedia
Emil Leon Post — Infobox Scientist name = Emil Leon Post image width = birth date = February 11, 1897 birth place = Augustów, then Russian Empire death date = April 21 1954, death place = New York City, flagicon|USA U.S. residence = nationality = field =… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia